Shortest Path Problem with Pixel Level Snakes: Application to Robot Path Planning
نویسندگان
چکیده
In this paper the application of the CNN-based active contour technique called pixellevel snakes (PLS) to find the shortest path in planar labyrinths is proposed. The strategy relies on multiple processing steps with a PLS algorithm implemented on the CNNUM. The proposal has been extended to approximate the shortest length path in sparse labyrinths suitable for applications like robot path planning.
منابع مشابه
Simulation of a Shortest Path using Pixel Method in Robotics Path Planning
This paper presents a technique of designing a wide path motion heuristic path in robots using artificial intelligence. The simulation results show the effectiveness of the method used.
متن کاملPath planning using Shi and Karl level sets
Path planning for mobile robots is a well researched problem for over three decades. In this paper, we test and evaluate a new approach based on Shi and Karl Level Sets for mobile robot path planning. The evolution speed of these level sets is the fastest available implementation of level sets till date that prompted us to test the algorithm in the path planning domain. Level Sets have the adva...
متن کاملStudy of Evolutionary and Swarm Intelligent Techniques for Soccer Robot Path Planning
Finding an optimal path for a robot in a soccer field involves different parameters such as the positions of the robot, positions of the obstacles, etc. Due to simplicity and smoothness of Ferguson Spline, it has been employed for path planning between arbitrary points on the field in many research teams. In order to optimize the parameters of Ferguson Spline some evolutionary or intelligent al...
متن کاملDynamic Multi Period Production Planning Problem with Semi Markovian Variable Cost (TECHNICAL NOTE)
This paper develops a method for solving the single product multi-period production-planning problem, in which the production and the inventory costs of each period arc concave and backlogging is not permitted. It is also assumed that the unit variable cost of the production evolves according to a continuous time Markov process. We prove that this production-planning problem can be Stated as a ...
متن کاملDesigning Path for Robot Arm Extensions Series with the Aim of Avoiding Obstruction with Recurring Neural Network
In this paper, recurrent neural network is used for path planning in the joint space of the robot with obstacle in the workspace of the robot. To design the neural network, first a performance index has been defined as sum of square of error tracking of final executor. Then, obstacle avoidance scheme is presented based on its space coordinate and its minimum distance between the obstacle and ea...
متن کامل